On splines and their minimum properties
نویسندگان
چکیده
0. Introduction. It is the purpose of this note to show that the several minimum properties of odd degree polynomial spline functions [4, 18] all derive from the fact that spline functions are representers of appropriate bounded linear functionals in an appropriate Hilbert space. (These results were first announced in Notices, Amer. Math. Soc., 11 (1964) 681.) In particular, spline interpolation is a process of best approximation, i.e., of orthogonal projection, in this Hilbert space. This observation leads to a generalization of the notion of spline function. The fact that such generalized spline functions retain all the minimum properties of the polynomial splines, follows from familiar facts about orthogonal projections in Hilbert space. 1. Polynomial splines and their minimum properties. A polynomial spline function, s(x), of degree m ≥ 0, having the n ≥ 1 joints x1 < x2 < · · · < xn, is by definition a real valued function of class C(−∞,∞), which reduces to a polynomial of degree at most m in each of the n+1 intervals (−∞, x1), (x1, x2), . . ., (xn,+∞). The most general such function is given by
منابع مشابه
Interpolation of fuzzy data by using flat end fuzzy splines
In this paper, a new set of spline functions called ``Flat End Fuzzy Spline" is defined to interpolate given fuzzy data. Some important theorems on these splines together with their existence and uniqueness properties are discussed. Then numerical examples are presented to illustrate the differences between of using our spline and other interpolations that have been studied before.
متن کاملConstrained Interpolation via Cubic Hermite Splines
Introduction In industrial designing and manufacturing, it is often required to generate a smooth function approximating a given set of data which preserves certain shape properties of the data such as positivity, monotonicity, or convexity, that is, a smooth shape preserving approximation. It is assumed here that the data is sufficiently accurate to warrant interpolation, rather than least ...
متن کاملComputer aided geometric design with Powell-Sabin splines
Powell-Sabin splines are C-continuous quadratic splines defined on an arbitrary triangulation. Their construction is based on a particular split of each triangle in the triangulation into six smaller triangles. In this article we give an overview of the properties of Powell-Sabin splines in the context of computer aided geometric design. These splines can be represented in a compact normalized ...
متن کاملDiscrete GB-Splines and Their Properties
Discrete generalized splines are continuous piecewise defined functions which meet some smoothness conditions for the first and second divided differences at the knots. Direct algorithms and recurrence relations are proposed for constructing discrete generalized B-splines (discrete GB-splines for short). Properties of discrete GB-splines and their series are studied. It is shown that discrete G...
متن کاملOn Discrete Simplex Splines and Subdivision
A variety of techniques to facilitate fast graphical display of curves and surfaces for interactive CAGD purposes have been developed, in the past years. Many of these are commonly referred to as subdivision algorithms PI. In this paper we propose a method for subdividing simplex splines, i.e., splines that can be defined over non-regular grid partitions. There is a relatively exhaustive theory...
متن کامل